/*
 * Copyright (c)e 2024-2024.Powered by 清明雨揽月
 * This software is licensed under Mulan PSL v2.
 * You can use this software according to the terms and conditions of the Mulan
 * PSL v2.
 * You may obtain a copy of Mulan PSL v2 at:
 *          http://license.coscl.org.cn/MulanPSL2
 * THIS SOFTWARE IS PROVIDED ON AN 'AS IS' BASIS, WITHOUT WARRANTIES OF ANY
 * KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO
 * NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
 * See the Mulan PSL v2 for more details.
 */

#ifndef CHAIN_BINARY_TREE_H
#define CHAIN_BINARY_TREE_H
#include <string>
using namespace std;

typedef struct BIT_NODE
{
    string data;
    BIT_NODE* left_child;
    BIT_NODE* right_child;
} bit_node;

class CHAIN_BINARY_TREE
{
public:
    void operate();
    // 先序遍历
    void preorder_traversal() const;

private:
    BIT_NODE* bit_tree{};
};

#endif // CHAIN_BINARY_TREE_H
